Hausdorff core of a one reflex vertex polygon
نویسندگان
چکیده
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q contained inside P which minimizes the Hausdorff distance between P andQ. Our algorithm essentially consists of rotating a line about the reflex vertex; this line defines a convex polygon by cutting P . To determine the angle at which the line should be rotated, our algorithm searches for a global minimum on the upper envelope of n continuous piecewise functions, where n is the number of vertices of P .
منابع مشابه
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
Given a simple polygon P , we consider the problem of finding a convex polygon Q contained in P that minimizes H(P, Q), where H denotes the Hausdorff distance. We call such a polygon Q a Hausdorff core of P . We describe polynomial-time approximations for both the minimization and decision versions of the Hausdorff core problem, and we provide an argument supporting the hardness of the problem.
متن کاملThe Hausdorff Core Problem on Simple Polygons
We present a study of the Hausdorff Core problem on simple polygons. A polygon Q is a k-bounded Hausdorff Core of a polygon P if P contains Q, Q is convex, and the Hausdorff distance between P and Q is at most k. A Hausdorff Core of P is a k-bounded Hausdorff Core of P with the minimum possible value of k, which we denote kmin. Given any k and any ε > 0, we describe an algorithm for computing a...
متن کاملTruly selective polygonal mesh hierarchies with error control
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The new hierarchical mesh representation combines a truly selective refinement scheme with a strict control of the two-sided Hausdorff distance. The proposed approach allows to build hierarchical meshes directly over non ...
متن کاملComputing a visibility polygon using few variables
We present several algorithms for computing the visibility polygon of a simple polygon P from a viewpoint inside the polygon, when the polygon resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in O(nr̄) time, where r̄ denotes the number of reflex vertices of P that are...
متن کاملComputing the Visibility Polygon Using Few Variables
We present several algorithms for computing the visibility polygon of a simple polygon P from a viewpoint inside the polygon, when the polygon resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in O(nr̄) time, where r̄ denotes the number of reflex vertices of P that are...
متن کامل